Persistent mesh for isolated mobile and temporal networking

ABSTRACT

A structured wireless mesh network is disclosed where a tree-like connection topology is formed. In one embodiment, each node has separate uplink and downlink radios operating on different channels. When a cluster of such nodes becomes isolated as in the case of a mobile mesh application, a node in the cluster according to this invention acts as a root node thus enabling the tree structure to persist, even in isolation. Example methods of joining sub networks are disclosed that guide the joining of mesh networks and channel management. Nodes that may operate in isolation also support a distributed DHCP capability such that IP addresses are assigned to clients even when a connection to a central DHCP server is unavailable.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of claim priority of provisionalfiling Ser. No. 61/148,803 filed on Jan. 30, 2009, presently expired andalso as a continuation in part of the U.S. Utility application Ser. No.11/084,330 filed Mar. 17, 2005, currently abandoned which in turn was acontinuation-in-part of U.S. Utility application Ser. No. 10/434,948,filed on May. 8, 2003, patented as U.S. Pat. No. 7,420,952 on Sep. 2,2008. Further, the instant application is a continuation in part of theU.S. Utility application Ser. No. 12/352,457, filed on Jan. 13, 2009,currently pending.

COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains materialwhich is subject to copyright protection. The copyright owner has noobjection to the facsimile reproduction by anyone of the patent documentor the patent disclosure, as it appears in the Patent and TrademarkOffice patent file or records, but otherwise reserves all copyrightrights whatsoever.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to wireless mesh networks and inparticular mesh networks used for mobile applications where continuityof operation is critical. In particular, the invention relates toclusters of mesh nodes that may become isolated from a wired or groundednetwork, but where communication remains possible within the isolatedcluster, resolving issues pertaining to mesh topology, channelmanagement and address management.

2. Background of the Invention

The instant invention relates to wireless networks comprising a set ofwireless access points, commonly referred to as a mesh network.

In mesh architectures, mesh nodes act as central structural elementsproviding means of connectivity to a broad range of client devices. Insome embodiments of the invention, mesh nodes are wireless accesspoints. Each client device communicates with an available mesh node oraccess point. The communication between client devices and access pointsmay occur using any means.

A “mesh” forms when a set of access points establishes communicationwith one another. The communication between the access points forms thestrands of an ethereal mesh. Client devices sit in the spaces betweenthe strands and establish communication with the access points which arefound at the intersections of the mesh strands.

While wireless mesh networks provide additional functionality notavailable using other network topologies, certain difficulties arecreated by wireless mesh networks described in the prior art.

A serious problem for mesh networks is created by the wireless mediumused for communication within the mesh. Radio is a shared medium whereonly one transmission may occur on each frequency at a time. The RFspectrum is divided into frequency ranges, or channels, to allow moreconcurrent transmissions. However, the channels cannot be made too smallso as to interfere with one another. Consequently, useable communicationfrequencies are generally divided into no more than a dozen channels,not all of which may be used concurrently.

In simplest mesh networks, known as ad-hoc mesh networks, allcommunication occurs on a single frequency or channel. In such simplenetworks, each access point (or AP) comprises a single radio and antenna(forming a single node) which provides communication means with clientdevices and other nearby mesh nodes. The benefit inherent in this meshis that the mesh coverage may be easily increased by introducing anadditional wireless access point. The sole configuration step for asimple ad-hoc mesh is the selection of the communication channel. Onedrawback of ad-hoc mesh is that each access point and client devicecontends with other access points to use the single communicationfrequency. Another drawback is that each access point or node in asimple ad-hoc mesh carries the entire routing table for the mesh networkas a whole, and must traverse the table each time a packet arrives inorder to know how to process the packet. As a result of both of thesecharacteristics, when the size of the mesh and the distance betweenaccess points increases, performance characteristics of the networkdecrease dramatically.

As networks grow, each access point's basic service set (BSS) increasesto the point where it can become unmanageable. The ability to subdividethe network into smaller groups is an approach to prevent scalingproblems, and one approach to subdividing the network is to introducetwo radios into each access point.

In a prior art dual radio mesh, as is depicted in FIG. 1(A), accesspoints include two radios: a relay radio 120 and a client-service radio110. The relay radio 120 operates at a first frequency, or channel ChQ130, to perform duplex (two-way) communication between the access pointsforming the mesh. Within this prior art mesh, all relay radios operateon the same channel, and each access point contains the routing tablefor the entire mesh network. Each access point in turn provides accessto one or more clients using the client-service radio 110 operating on asecond frequency. Essentially, these are one radio ad-hoc mesh nodeswith a client-service radio added.

This prior art system, while simple to implement, does not scale beyonda limited number of radios. Rather, throughput drops exponentially asthe number of access points increases, especially in instances wheredownstream access points attempt to connect to an exterior network 108.In essence, the access points in this conventional mesh form thewireless equivalent of a hub. Like hubs, single radio mesh backhauls donot scale as well as multi-radio backhauls in addressing high bandwidthrequirements for mission critical mesh networks, especially when thesingle radio solution carries the entire routing table for the mesh ineach node.

In contrast with the hub-like operation of FIG. 1(A) is the wirednetwork switch presented in FIG. 2. As shown in FIG. 2, each networkswitch includes uplinks 210 and one or more downlinks 220 forming atree-like structure. The traffic within each switch comprising thisconventional wired switch stack operates within specified sub-domains.Therefore, the size of any one sub domain is limited and ensures thatlocal traffic inside a sub domain, or between multiple sub domains doesnot slow down the entire network. This multi-domain switch architectureis more efficient than hub configurations in that it allows for scalablenetworking. Contributing to this scalability is the distributed routingtable methodology that is typically implemented in a conventional wirednetwork switch. However, drawbacks exist. Namely, the prior-art switcharchitecture has been implemented using physical wireline connectionsbetween discrete switches and not a flexible mesh architecture employingwireless connections.

The present invention is designed to overcome the challenges inherent inthe prior art solutions. In one embodiment, the instant invention isbased on a two-radio mesh network, where each mesh node includes oneradio for the uplink backhaul and another servicing clients andproviding the downlink backhaul to other nodes (descendent nodes) of thenetwork. Mesh nodes implemented with such a multi-radio backhaul form ahierarchical tree-like network topology called a “Structured Mesh”, whenthey connect to each other, and as described in the referencedapplication Ser. Nos. 11/084,330, 10/434,948, and 12/352,457, operate ina manner similar to a wired switch stack where the routing table isdistributed, thus aiding network scalability. A distributed routingtable is constructed such that each node only contains informationrelated to its descendant nodes and its parent node, but no other nodesin the network hierarchy tree above its parent. This way, the processingload for each node to process a packet is reduced. Although the highestperformance for a “Structured Mesh” network occurs when separate radiosare utilized for uplink and downlink connections, performance may alsobe enhanced when only a single relay radio is used as long as adistributed routing table methodology is utilized thus simplifying therouting computational task and thereby increasing the performance of theprocessor within the mesh node. For mission critical mesh applicationssuch as military or first responder, it is also advantageous to includeboth single and multi-radio nodes whereby they can all communicate witha consistent routing protocol.

In some embodiments of the invention, the root of the hierarchical treestructure includes an external network connection to a server, to a WAN(Wide Area Network), to the Internet, or to any combination of theseoptions. When a group of nodes implemented as such become separated orisolated such that the sub-network does not include a root connection asdescribed above, challenges exist in maintaining a the requiredtree-like structure.

Unlike prior art mesh networks, a need exists in the art for a systemcapable of maintaining communication within a cluster during physicalrealignment of cluster components, as occurs during movement of wirelessnodes in a mobile mesh network implemented as a tree-like structuredmesh network.

SUMMARY OF INVENTION

An object of the invention is to provide a mesh network which overcomesmany of the disadvantages of the prior art.

Another object of the invention is to provide a mesh network whichretains structural integrity during all phases of usage, repair, orupgrading. A feature of the invention is that the logical relationshipbetween network wireless access points or nodes is reconfigured by thenodes following changes to the physical environment of the network. Anadvantage of the invention is that it maintains the benefits of itsstructured approach even following additions, subtractions, orreadjustment of network components, and regardless of whether mesh nodescontain one or multiple relay radios.

Yet another object of the invention is to maintain a structure to a meshnetwork such that separate data domains are maintained throughout themesh network. A feature of the instant invention is that the structureof the mesh creates separate data domains within a larger network mesh.An advantage of the instant invention is that traffic within one or moredomains does not impact non-involved domains.

Another object of the invention is to maintain connectivity with a meshnetwork, when connections to external networks are compromised. Afeature of the invention is that network connectivity within a sub-partof the mesh network is maintained during the time the sub-part of themesh network is not connected to an external network. An advantage ofthe invention is that it maintains a structure to support connectivitywithin the sub-part of the mesh even when the sub-part moves away froman external network link.

Another object of the invention is to facilitate re-connection to anexternal network subsequent to loss of an external network connection. Afeature of the instant invention is that a sub-part of a mesh networkwhich looses a connection to an external network may be configured tocontinuously scan for an available external network link. An advantageof the instant invention is that any part of the network separated froman external link, if directed to, will attempt to reconnect to theexternal link as soon as possible and therefore limit the amount of timea subpart lacks external network connectivity.

An object of the instant invention is to support orderly changes ofconfiguration in a mesh network. A feature of the invention is that oneor more components of the invention may be mobile. An advantage of theinstant invention is that the underlying logical structure is updated toreflect physical changes in an orderly manner so as to maximizeconnectivity within each network subcomponent.

Yet another object of the invention is to facilitate joining ofpreviously disparate structured mesh networks. A feature of theinvention is that the logical structure of the network facilitates thejoining of two previously distinct sub-networks. An advantage of theinstant invention is that the mesh network can resume its structure uponthe joining of two or more networks to form a larger structured meshnetwork.

Still another object of the invention is to facilitate orderly loss of amesh participant. A feature of the invention is that the structure ofthe mesh is realigned following the loss or departure of one or moreaccess points previously participating in the mesh. An advantage of theinstant invention is that the mesh network structure can accommodate thewithdrawal of one or more of the participating nodes with minimaldisruption to the remaining network.

An object of the invention is to provide continuous access to networkservices upon the separation of one or more nodes from a larger network.A feature of the instant invention is that network services, such asaddress allocation pursuant to DHCP, which in the usual network areprovided by a single central location, continue to be delivered toclients within a mobile subpart of the larger network. An advantage ofthe instant invention is that clients that move out of a larger networkcontinue to have access to services, such as DHCP, during the time thesub-part of the network is separated from the larger network.

In one embodiment, the invention consists of at least two structuredmesh nodes; wherein each structured mesh node comprises at least aconnectivity logic; an uplink radio operating on an uplink frequency anda downlink radio operating on a downlink frequency; wherein theconnectivity logic determines whether each structured mesh node connectswith an external network or another node using its uplink radio andclient devices or other mesh nodes connect to each node using eachnode's downlink radio; wherein the structured mesh network functions intwo configurations selected depending on whether a connection to anexternal network is present; in the first connected configuration thestructured mesh network includes at least one structured mesh node'suplink radio comprises a connection to an external network; and in thesecond isolated configuration none of the structured mesh nodes' uplinkradio comprises a connection to an external network, and one of thestructured mesh nodes acts as an isolated network root of the isolatedconfiguration and all remaining nodes' connect to the isolated networkroot node as isolated root children nodes forming a tree-likeconfiguration.

In another embodiment, the invention consists of at least two structuredmesh nodes; wherein each of said at least two structured mesh nodescomprises at least a connectivity logic and a single relay radio;wherein the connectivity logic determines how each structured mesh nodeconnects with an external network or another node; wherein thestructured mesh network functions in two configurations selecteddepending on whether a connection to an external network is present; inthe first connected configuration the structured mesh network includes aconnection to an external network; and in the second isolatedconfiguration none of the structured mesh nodes comprises a connectionto an external network, and one of the structured mesh nodes acts as anisolated network root of the isolated configuration and all remainingnodes' connect to the isolated network root node as isolated rootchildren and descendant nodes forming a tree-like configuration.

BRIEF DESCRIPTION OF DRAWING

The invention together with the above and other objects and advantageswill be best understood from the following detailed description of thepreferred embodiment of the invention shown in the accompanyingdrawings, wherein:

FIG. 1( a) depicts a prior art mesh network;

FIG. 1( b) depicts a mesh network featuring a dual-radio backhaul orrelay pursuant to the instant invention;

FIG. 2 depicts a prior-art wired stack of network switches;

FIG. 3 depicts an embodiment of the instant invention comprising threesub-networks featuring the mesh structure of the instant invention;

FIG. 4 depicts an embodiment of the instant invention comprising twosub-networks featuring the mesh structure of the instant invention;

FIG. 5 depicts an embodiment of the instant invention comprising oneoverall network featuring the mesh structure of the instant invention;

FIG. 6 depicts two configurations of an embodiment of the instantinvention;

FIG. 7 depicts two configurations of an embodiment of the instantinvention;

FIG. 8 depicts two configurations of an embodiment of the instantinvention; and

FIG. 9 shows a summary of the operation of a distributed DHCP servicepursuant to the instant invention.

DETAILED DESCRIPTION OF THE INVENTION

The foregoing summary, as well as the following detailed description ofcertain embodiments of the present invention, will be better understoodwhen read in conjunction with the appended drawings.

In some embodiments of the instant invention, the inter-access pointcommunication occurs using agreed-upon wireless communication protocols,but a mesh may employ any communications means, wired or wireless.Further, one or more of the access points may be connected to anexternal network whereby client devices in communication with the meshare capable of accessing the same external network.

Depicted in FIG. 1(B) and in FIG. 2 are two examples of mesh networksfeaturing links to an external network. Turning first to FIG. 1(B),depicted there are three nodes 145, 155, 165, wherein each nodecomprises an uplink connection and a downlink connection. Each node isconsidered an access point or “AP,” and each node is physicallyidentical, in one embodiment. For example, the top-most or root node 145includes an uplink connection 144 and a downlink 133.

The root node 145 comprises an uplink 144 to an external network 108. Adownlink wireless connection 135 on the root node 145, connects the rootnode 145 to its immediate child node 155. Inasmuch as the root node 145includes a connection to both its child node 155 and the remainingdescendant nodes in the mesh (nodes 155 and 165). Combined with aconnection the external network 108, the root node 145 is considered afull functionality root (or FFR) node. (If the root node 145 did notinclude a connection to the external network 108, it would be considereda limited functionality root (or LFR) node.)

The downlink wireless connections 135 on the three nodes depicted inFIG. 1( b) employ distinct frequencies for transmission or transmissionchannels. The downlink on the root node 145 employs channel “ChX.” Inturn, the uplink on the first child node 155 employs “ChX” tocommunicate with the root node 145. In turn, the first child node 155uses a different frequency or channel “ChY” to communicate with itsimmediate child node 165. The child node 165 uses the same ChY channelon its uplink so as to be able to communicate with its parent node 155.Finally, the child node 165 uses a third channel “ChZ” to communicatewith any one or more nodes downstream (not pictured). In one embodimentof the present invention each of AP 145, 155, and 165 may employseparate radios for uplink and downlink connections. In anotherembodiment, a single radio may be employed in these APs. When a singleradio is employed, it may utilize separate frequencies for uplink anddownlink connections such as channels X, Y, and Z shown in FIG. 1B.Alternately, a single radio implementation may utilize the samefrequency for uplink and downlink, essentially making channels X, Y, andZ all the same. A single channel implementation creates more co-channelinterference in the mesh than a multi-channel implementation, but hassome simplifications of operation that may be advantageous in somecircumstances. Regardless of whether single or multiple relay radios areused, or how many RF channels are utilized for communication within themesh, according to the present invention the connection topology willalways be formed in a tree-like structure and each mesh AP or node willcontain routing table data and connectivity logic consistent with adistributed routing table structure and a tree-like connectivitystructure.

Each node connects with one or more client devices 156 wherein theclient devices use the downlink channel on each node to communicate withthe node. Therefore, for the specific implementation shown in FIG. 1 B,the client 156 of node 155 communicates with node 155 using ChY. Theclient of node 165 communicates with node 165 employing ChZ.

Inasmuch as the child nodes 155 and 165 are able to communicate with theexternal network through the root node 145, these nodes are consideredfull functionality nodes (or FFN). Conversely, if the link 144 to theexternal network 108 was unavailable the child nodes would be consideredlimited functionality nodes (or LFN).

The benefit of the design of FIG. 1( b) stems from the structuraldivision of communications between distinct devices. For example, aclient 156 of a node 165 will not interfere with a client 156 of adifferent node, such as node 155. Inasmuch as channels ChX, ChY, and ChZare selected so as to limit interference between these nearbyfrequencies, the wireless system divides clients of different nodes intodifferent domains. This is the benefit of the instant invention whosesystem acts as much as the wired switch stack depicted in FIG. 2.

The structured approach of the instant invention may be implementedusing any number of strategies. In the case of fixed-point wirelessaccess points, the network channel assignments may be managed manuallyso as to create the separation of network domains discussed herein.However, an entirely different approach is required when dealing withmobile access points. In these instances, the mesh network must becapable of both maintaining the structure described above as well asaccommodating movement of constituent access points and client devices.

Wireless mesh networks must be able to maintain the overall structurewhile accommodating change over time. The movement of a node, or set ofnodes, may result in status changes for the moved nodes. For instance,when a node is communicating with an external network, its status isthat of a full functionality node, or a full functionality root node.However, this node may move away from the external network link, loosingcommunications with same. The invention enables the remainingneighboring structured nodes to realign and compensate for the loss ofthe node. The transient node is reconfigured to reflect its new statusand a new position.

The instant invention is a mesh network undergoing configurationchanges. The mesh network starts in a first configuration and thenenters a second configuration upon the occurrence of one or more events.A series of changes to the network may define overlapping sets ofchanging configurations. For example, if in an established mesh network,one node moves away from the network, and then returns to the mesh, thenetwork has gone through a plurality of status changes.

As depicted in FIG. 1(B), the mesh network contains a link 144 to theexternal network 108. Such a network is considered “grounded” in thatthe network includes external access. The external network link 144 neednot be a physical grounding, and may be accomplished through a wirelessconnection. Inasmuch as all the nodes 145, 155, 165, in FIG. 1( b)include a connection to the external network 108 these nodes are allconsidered grounded. In other words, while nodes 155 and 165 areembedded within the network such that the node 145 is intermediate thenodes 155 and 165 and the external network, nonetheless, all nodes aregrounded to the network 108 simultaneously. If another node (notpictured) was not in communication with the external network 108 itwould be considered a floating node or an isolated node.

Turning now to FIG. 3, depicted therein is an array of several accesspoints having different connectivity status and therefore differentroles. For example, one node 350 is connected to an external network 108using a link 351. The link may employ any one of several networkconnectivity methods, including a wired Ethernet link, a satellite link,or a radio-based wireless link such as wifi or wimax. Inasmuch as node350 is directly connected to the external link it is considered a fullfunctionality node. Further, inasmuch as it is not connected to anothernode on its uplink, the node 350 is a root node. Combining the two nodestatuses, node 350 is a full functionality root node or FFR. On thedownlink side of the FFR node 350, one client device 340, shown as aphone, is communicating with the FFR node 350. Given the client device340 association with a FFR node 350, this client device 340 is able tocommunicate with the external network 108.

FIG. 3 also depicts three other networks 310, 320, and 330. Theseremaining networks do not have a connection to the external network 108and therefore are considered to be floating networks or isolatednetworks. Networks 310 and 320 consist of single nodes 311 notassociated with other nodes. Inasmuch as nodes comprising networks 310,320, and 330 lack a connection to the external network 108, these nodesare considered limited functionality nodes. Clients of the limitedfunctionality nodes, such as the client device 313 of the limitedfunctionality node 311, do not have access to the external network 108.

Nodes comprising floating networks may form sub-networks betweenproximate nodes. In sub-network 330, one node 361 acts as a root nodeand is associated with two client nodes 363 and 365. The three nodes361, 363, and 365, are able to communicate with one another. Therefore,the clients 364 associated with these three nodes are able tocommunicate with one another despite the lack of a connection to anexternal network 108 and the services available on the external network.

As shown in FIG. 3 both the grounded network 309 and the floating orisolated networks 310, 320, 330 share a common tree-like structure inthat both types of networks encompass nodes with at least one node beinga root node for all networks having more than one node. The roles andlabels applied to each type of node are important to the functioning ofan embodiment of the invention described below.

Inasmuch as the mesh nodes described by the instant invention comprisemobile nodes, one of the possible status changes is the establishment ofcommunication between an isolated node, which would be a limitedfunctionality node, with a grounded full functionality node.

Joining of Isolated Nodes to Grounded Nodes

As shown in FIG. 3, isolated nodes 311 lack a connection to the externalnetwork 108. Full network functionality is achieved through connectionto the external network 108. In some embodiments of the invention,limited functionality nodes, such as nodes 311 will continuously scan toevaluate whether a connection to a full functionality node, such as node350, is available. In other embodiments, the nodes do not focus onconnection to a full-functionality node, inasmuch as the connectionlogic within the nodes 311 is programmed to follow a different set ofpolicies. For example, limited functionality nodes may scan in anattempt to connect with other limited functionality nodes and/or fullfunctionality nodes. In sub-networks comprising more than one node, suchas sub network 330, the connection logic of each node is set to searchfor connections to other nodes thereby increasing the area where aconnection may be found.

Pursuant to a searching directive, networks 310 and 320 coalesce byestablishing a link between their two limited functionality nodes 311.Further, the expanded network, may in turn establish a connection withthe full functionality node 350. This expanded network is depicted inFIG. 4.

Turning now to FIG. 4, the grounded network, previously consisting ofonly one node 350 currently includes the full function root 350 as wellas the sub-network 410 comprising nodes 411. The nodes 411 areconsidered full function nodes 411 inasmuch as these nodes, and thenodes' respective clients, are now connected to the external network108. The external network is accessible through the connection 420between one of the full function nodes 411 and the full function rootnode 350. The clients of the full function nodes 411 may continue tocommunicate within the sub-network 410 or exchange information with theexternal network 108 using the connection 420 to the full function rootnode 350 which in turn is connected to the external network 108.

Also depicted in FIG. 4 is a second isolated network 430. This secondisolated network 430 is unable to establish communication with any fullfunction nodes. Therefore, the clients associated with nodesparticipating in the sub-network 430 are only able to communicate withinthe sub-network 430. However, this embodiment of the instant inventionprovides a means for dividing network traffic into sub-domains giventhat communications between the clients of the sub-network occurindependently of the status of the full function nodes.

In one embodiment, the limited functionality nodes of the sub-network430 continuously scan in an attempt to establish connectivity betweenthe limited functionality nodes and a full functionality node. Forexample, node 461 continues to scan for any full-functionality nodesnearby using its uplink and downlink radios.

Turning now to FIG. 5, depicted there is a change of configuration ofthe system wherein the node 461 establishes a communication link 520with a full-functionality node 411. Upon the establishment of the link520, the node 461 becomes a full functionality node inasmuch as the nodeis now able to communicate with an external network 108. All nodes inthe newly established network 510 have become full function nodesinasmuch as every node in the network 510 is connected to the externalnetwork 108 through the full function root node 550.

The network transformations depicted in FIGS. 3 to 5 are driven bypolicy directives within each network node. A network node comprisesconnectivity logic which allows the node to react to similarenvironmental circumstances in different ways depending on the policydirectives set as part of the initialization process of the connectivitylogic. For instance, in FIG. 4, one of the nodes 411 established a link420 to the full functionality root 350 inasmuch as the connectivitylogic on the node 411 instructed the node to search for opportunities toconnect to full functionality nodes. The initialization procedure isdiscussed below.

Initialization of Nodes

In one embodiment of the invented system, the directives for each nodeare set using a policy server during a node initialization step. As partof the node initialization, the policy server directs the node to takeon one or a plurality of roles. For example, the node may be instructedto continuously look for a full functionality node (either a root oranother node). Conversely, the node may be instructed to follow a radiosilence policy where it specifically avoids contact with other nodes.For purposes of illustration, the embodiments described herein generallyseek out other networks to increase network coverage by establishingconnections between limited functionality and full functionality nodes.In light of the type of mission to served by the mesh being initialized,the policy directive may involve any one of several alternativeinstructions.

The invention provides several methods of joining sub-networks, whereinthe sub-networks are either grounded (connected to an external network)or floating (isolated from an external network). FIGS. 6 to 8 describealgorithms for connecting various types of networks.

Joining of Sub-Networks

Turning now to FIG. 6, described therein are three sub-networks 610,620, and 630. Sub-network 610 comprises a root node 611 and three childnodes 612, 613, and 614 connected to the root node 611. At a first timeinterval 6000 shown in FIG. 6, node 613 is establishing a link 625 witha node 621 of another sub network 620. At time interval 6000, the nodesof sub-network 610 are limited functionality nodes inasmuch as the nodescontain connections to each other, but not an external network (notshown). The second sub-network 620, however, includes a fullfunctionality node 621 which is in communication with a full functionnode or the full function root (not shown).

A second time Interval 6100 shown in FIG. 6 occurs following theestablishment of the link 625. The node 613 has successfully establisheda stable link 626 with the node 621. The resulting network 630 nowfeatures full functionality nodes inasmuch as each node include aconnection to the full functionality root (not shown) through the fullfunctionality node 621. Node 611 functioned as a limited functionalityroot at the first time interval 6000 inasmuch nodes 612 and 613 were incommunication with it. However, at the second time interval 6100, node611 lost its status as a root given that its traffic now reaches thedestination through another node 613. The loss of the root node role bynode 611 was caused by the fact that one of a child node 613 detectedthe full function node 621.

While channel management policies (described below) ensure that thejoining of the networks 610 and 620 is possible, it may be preferred toallow only the limited functionality root node 611 to initiate theconnection with the full function node 621. If the limited function rootnode 611 initiates the connection 626, the structure of the sub network610 need not change logical structure. While the limited functionalityroot node 611 would cease to operate as a root node 611 upon connectionwith the full functionality node 621, no structural changes arenecessary to the sub-network 610.

Consequently, in some embodiments of the invention, one of the policydirectives set during the initialization of the nodes is to limitscanning for full function nodes to solely the roots of each floating orisolated network.

FIGS. 7 and 8 demonstrate embodiments of the invention wherein joiningof networks requires the resolution of several conflicts prior to thejoining of several sub-networks.

Turning first to FIG. 7, depicted there at a time interval 7000 are twosub-networks 710 and 720. Sub-network 715 is traveling in the Northeastdirection 715. Sub-network 720 is also traveling in the Northeastdirection 725. Node 721 of sub-network 720 is a limited functionalityroot. Node 711 of sub-network 710 is a limited functionality node whichconnects through its uplink to another limited functionality root (notshown) upstream 727 from node 711.

If the policy directive instilled in the node 721 is to join with anynew nodes detected, even if the new node is a limited functionality one,then node 721 would have to give up its status as a root node uponconnecting to the detected node. In the embodiment shown in FIG. 7, attime interval 7100, node 721 establishes a link 735 with the node 711.Inasmuch as the node 721 is now connected with another node 711, thenode 721 ceases to be a root node.

In the embodiment shown in FIG. 7, the nodes comprising the twosub-networks 710 and 720 are aware of the direction of travel of the twonodes. Inasmuch as node 721 realizes that node 711 is ahead of node 721,node 721 considers itself to be “downstream” in the direction of travelfrom node 711. Consequently, in connecting with node 711, node 721relinquished its status as a root node and instead became a standardlimited function node. The resulting network 730 shown at time interval7100 continues to travel in the same Northeastern direction 739 with asingle limited functionality root node (not shown).

As is shown in FIG. 7, in some embodiments of the invention, the nodescomprising the mesh network or sub-networks contain movement-detectionmeans. In one embodiment, the movement detection means comprises a GPSsensor, however, other methods, such as radio signal triangulation ofcellular telephone signals may be used. The nodes comprising the meshnetwork shown in FIG. 7 exchange with each other each node's currentposition as well as each node's direction of travel so as to be able todetermine which node is downstream of which node.

Turning now to FIG. 8, depicted therein are two time intervals 8000 and8100. At time interval 8000, two sub-networks 810 and 820 are separatedfrom one another. Sub-network 820 comprises four nodes 821, 822, 823,824 with one node 821 being the root. Conversely, sub-network 810comprises two nodes 811 and 812 wherein node 811 is the root. Inasmuchas neither sub-network includes a connection to an external network (notshown), both networks are floating networks and all nodes comprising thenetworks are limited functionality nodes.

At point 8000, root node 821 detects root node 811 by a running a scan825. Simultaneously, root node 811 detects root node 821 by operating ascan 815. Before the two sub networks may join together, one of thenodes must relinquish its role as a root node. In FIG. 7, the decisionas to which node will become the root node was determined by thedirection of travel of each sub network. In the embodiment shown in FIG.8, the sub networks are not aware of their respective directions oftravel. Therefore, the choice of a new root node must be made using aconflict resolution policy.

Several alternative policies may be implemented to determine which nodeshould relinquish its role. For example, the root node of the largernetwork (node 821) could be allowed to remain the root node pursuant toone policy. In another tie-breaker policy directive, a root node ischosen randomly. Depending on the embodiment of the invention involvedin the conflict, it may be decided that the root node closest to theexternal network maintains its status. This “geographic proximity”policy requires nodes to contain means of detecting geographic positionas well as being provided the last known position of a full functionnode (i.e. a node with a connection to an external network). Anothertie-breaker policy may factor which node is farther downstream, as wasthe case in FIG. 7.

Other reasons to select a root node relate to the data traffic found onboth sub-networks. In one traffic-based method, the root node traversedby more traffic is allowed to keep its status. Alternate traffic-basedanalysis methods compare the properties of the several possibleresulting networks. For example, in one method, a root node is chosensuch that the resulting network's traffic must traverse the fewestnumber of nodes in order to reach its destination. Minimizing the numberof access points that must be traversed for traffic to reachdestinations results in improved performance of the network. In terms ofperformance, the root may also be chosen such that the resulting networkfeatures maximum bandwidth or minimum delay of traffic due to signalloss (jitter). Another approach seeks to minimize the latency of theresulting network.

Any one of the above policies is employed to achieve the performancegoals of a given mesh network implementation.

In FIG. 8, the policies of the root nodes 821 and 811 resulted in theselection of node 811 as the root node. Therefore a new connection 835was established at time interval 8100 and the node 821 ceased to be aroot node but instead became a standard node. Node 811 remained the rootnode and at time interval 8100 became the root node of a new combinednetwork 830.

Provision of Network Services

Network devices generally rely on one or more services provided by oneor more servers connected to the network used by the network devices.For example, in order for network client devices to communicate witheach other and with the nodes, each client device and each node must beassigned an identifier, such as an IP address. While it is possible tomanually assign IP addresses to devices, this manual apportionment ofaddresses creates significant overhead in that each device must betracked and its IP address assignment recorded so as to ensure that notwo devices are assigned the same IP address.

In order to avoid manual assignments of addresses, wired networks employnetwork-wide services such as a Dynamic Host Configuration Protocolserver, (hereinafter “DHCP”) to assign IP addresses to clients. In anembodiment of the invention, only one DHCP server exists in a network toensure that no IP conflicts are created. While wired networks may employa single DHCP server, isolated networks have no access to this singleserver. Therefore each isolated network node servicing clients accordingto the instant invention will include its own DHCP server.

When previously-isolated sub-networks establish network connectivity forthe first time, there is a possibility of IP address conflicts betweenthe client devices, especially if the nodes rely on a conventional DHCPserver. An enhanced DHCP server is discussed infra. A conventional DHCPserver may have previously assigned addresses to clients in eithercluster, and inadvertently assigned redundant addresses. To avoid thisproblem, a means for assigning IP address is disclosed infra for thedistributed DHCP server capability in network nodes according to thisinvention.

While an IP address conflict may be resolved through arbitration,prevention of address conflicts is preferable. An approach to reducingthe probability of a conflict to less than 1 in 215 is described. Notethat the same approach may be used to reduce the probability evenfurther to 1 in 2³² or lower. Further, the approach is applicable to anydevice network identification scheme, such as IPv4 or IPv6.

The reduction in the probability of a conflict is accomplished bysplitting up or otherwise separating the IP domains in an autonomous andrandomized manner such that each mesh node has a range of IP addressesthat it can freely assign to clients with de minimis risk of IPconflicts occurring. Each mesh node randomly selects a DHCP range toassign client addresses. As part of the process of discovering andconnecting with new network nodes, this DHCP range is broadcast in aspecial information packet to other nodes when the node is scanning tojoin other nodes. If there is a conflict in the range, it is resolved byone node selecting a new DHCP address range, a random number range setis selected and tie breaker functions are employed all before the nodesbecome part of the same network. This pre-emptive measure is a means toensure minimal disruption of client services.

IPv4 addresses assigned by DHCP servers take the form A.X.Y.K. whereineach number is an integer from 0 to 255. Let A arbitrarily be set basedon a customer identifier for the mesh network layout. K is chosen as anidentifier for a client attached to the network node. Therefore, eachclient of a single node will share the same first three digits of an IPaddress, with the last digit “K” being incremented for each clientdevice connected to a single node.

With A and K selected, X and Y combinations provide a total of 2*16integers or 232 possibilities. This amounts to over 65,336 network nodescoexisting in the same place each with up to 255 clients each with noinherent IP conflicts.

Let us assume that a 15 bit random number generator is used to generatethe values for X and Y at each isolated network node. Sections of therandom number may be used to set the values for X and Y for the DHCPserver at each node. Let M and N be the decimal equivalent of the 7 MSBand 8 LSB of the 15 bit random number. The DHCP address space is then:A.[255−M].N.0 to A.[255−M].N.254 where 0<=M<=127 and 0<=N<=255

This allows for a network of up to 32768 network nodes with distributedDHCP capability—each of them having up to 255 clients each.

The improved DHCP server is summarized in FIG. 9.

Channel Management

As shown in FIG. 1( b), the mesh nodes follow the switch-stack approachof FIG. 2 inasmuch as FIG. 1( b) nodes utilize a separate uplink anddownlink communications means. In case of wireless nodes, each uplinkand downlink communication means comprises a wireless radio wherein thefrequency or channel of each respective radio is distinct and thereforenon-conflicting. Every backhaul radio is on a different, non-interferingchannel creating independent subnets which split the larger mesh intosuccessive sub-domains.

The downlink and uplink frequency selections create relationshipsbetween nodes. For example, in FIG. 6, at time interval 6000, node 611is the root node with nodes 612 and 613 being its immediate children.Inasmuch as node 611 is a wireless node it uses two frequencies, anuplink frequency and a downlink frequency. The uplink frequency on node611 is not being used for communication inasmuch as node 611, being aroot, is not connected to another node above it. However, the separatedownlink frequency is being used to communicate with both children nodes612 and 613. Node 613 is shown extending a scan 625 searching foranother node, via the uplink of node 613.

The joining of two previously separated networks, as is shown in FIGS.6, 7, and 8, may create channel conflicts within the resulting networkinasmuch as previous child-root relationships may be disrupted. Anexample of a disrupted relationship is shown in FIG. 6 at time interval6100 wherein the node 611 became a child node of node 613 while at theprior time interval 6000 the node 611 had been a parent of node 613.

In order to facilitate the transition between node statuses, the instantinvention applies a series of policies which are introduced into eachnode during the mesh initialization step described above. In otherembodiments, the merging conflict resolution policies are updatedregularly during mesh deployment. Regardless of the way in which thepolicies are introduced, the policies must be able to accommodate anynumber of possible network join events. FIG. 6-8 demonstrated only a fewpossible join scenarios. Consequently, the conflict resolutions must notbe exceedingly strict.

In some embodiments, one of the goals of the conflict resolutionpolicies is to decrease the number of channel changes necessary uponjoining of networks. For example, in FIG. 7, node 721 uses its otherwiseunoccupied uplink to detect node 711 at time interval 7000. Inestablishing a connection 735 between the uplink of node 721 and thedownlink of node 711, the uplink node 721 changed the node 721 uplinkchannel to match the downlink channel of node 711. This channel switchwas the only change of channel necessary to bring the two networkstogether. At time 7100, the uplink channel of node 721 wasnon-conflicting with the downlink channel of node 721. In oneembodiment, one of the policies of joining stored in the nodes is toaccept a partial channel conflict upon joining so as to minimizecascading channel changes.

The more common circumstance is that a node other than a root is the onethat establishes a new connection. In such instances, more than onechannel change may be required. The invented system therefore comprisesseveral methods of changing channels.

The Least Ripple Match

One approach to changing channels is minimizing the number of channelchanges within the mesh needed to maintain separation. For example, inFIG. 6, the establishment of a network link 626 between node 613 and 621forces node 613 to adopt as node 613 uplink frequency the downlinkfrequency of node 621. If node 613 has to change its uplink frequency,then the connection to node 611 would be terminated, unless node 611also changes its downlink frequency accordingly. However, changing thedownlink frequency of node 611 would force a change of frequencies bynode 612. Consequently, changing the frequency by node 613 results in atleast three changes of frequencies. This number of frequency changes isunfavorable inasmuch as any client devices in communication with nodes611, 612, and 613 would also have to change communication frequenciesand may temporarily loose a connection.

The alternative scenario at time interval 6000 is for node 613 tomaintain its uplink frequency and for node 621 to change its downlinkfrequency. If node 621 changes its downlink frequency to match theuplink frequency of node 613, then at time 6100 the link 626 may beestablished. However, the link was established with only a singlefrequency change—the change of the node 621 downlink frequency to matchthat of the node 613 uplink.

The second scenario described above results in the fewest changes andconsequently would be the one adopted by the system in one embodimentwherein joining of networks is to occur with the fewest changes. Thenodes comprising the mesh are able to keep track of the frequencies ofnodes participating in the mesh so as to be able to calculate the numberof changes necessary in an expedient manner.

In some embodiments the mesh network nodes calculate all possiblechanges necessary and select the alternate with the fewest changesrequired. In other embodiments, the mesh network selects a scenarioresulting in an acceptable local minimum number of channel changes.

Further, while in FIG. 6, solely node 613 detected the presence of node621 using its scan 625, some of the frequency adjustments may have beenavoided if node 611, the limited functionality root, had been the one toconnect with node 621. Consequently, in some embodiments of theinvention, only unused uplinks on roots nodes are used for scanning fornew connections. However, the networks are most likely to join togetherif all the nodes are scanning for possible neighbor nodes within range.

Local Optimization

In some embodiments of the invention, each node determines locally as towhether to change frequencies upon joining with another node. In thisdefault environment, no frequencies are set aside and each node attemptsto determine which channel change results in the best local outcome.

The software for making autonomous choices for each node is described inapplicant's earlier patent application U.S. application Ser. No.10/434,948 filed on May 8, 2003, now U.S. Pat. No. 7,420,952, whosecontents are incorporated by reference. As described in that earlierapplication, the autonomous choices are designed to fulfill one or morelocal efficiency goals.

The first goal is to ensure that there is sufficient channel separationbetween uplink and downlink radios on the local node to ensure adequateadjacent channel separation. Channel separation is considered sufficientwhen the frequencies of one channel are so different as to result in nointerference with the transmissions on another frequency.

Second, each node seeks to limit ripple effects caused by changing anuplink or downlink frequency where the local node is connected to othernodes either on the downlink side or the uplink side. If no conflict canbe avoided, after a scan of the environment, downlink channels areselected based on the least congested channel that also satisfiesconditions for channel separation between uplink and downlink.

The alternative methods rely on specifying sets of channels to a node orgroups of nodes. Internal channel sets are designed for communicationbetween nodes while common sets are designed for communication withother networks. By assigning non-conflicting channels sets, sub networkcombinations can occur with less contention.

Internal Channel Sets

A further approach to minimizing channel switches during joining ofnetworks is to assign different channel subsets to each network duringthe initialization of the nodes which are predetermined to comprise agiven network.

In some embodiments, the mesh member nodes are allowed to changemembership as the physical position of each member node changes. Inother embodiments, the member nodes stay within one general group,forming a substantially permanent sub network. While the sub network maybe mobile, the member nodes comprising the mesh remain constant.

Given a circumstance where the sub networks have at least partiallypermanent membership, certain channels are dedicated for use by aparticular sub network or a plurality of sub networks, and no other subnetwork within the area. Consequently, upon joining of several subnetworks, the sub networks do not suffer from internal conflicts, butmust only negotiate frequencies to facilitate inter-sub-networkcommunication.

Use of Common Channel Sets

A further addition to methodology is to dedicate certain frequencies toact as joining frequencies dedicated to serve as the uplink channels ofroot nodes and the downlink channels of leaf nodes of the tree. In otherwords, the leaf nodes use special downlink frequencies if no other nodeis connected on the downlink frequency. By employing the commonchannels, two networks are able to join together while leaving channelassignments inside the network constant.

For example, in FIG. 7, each sub network 710 and 720 may represent asingle convoy of military trucks. In some embodiments, the convoys arephysically designed to meet only at the head and the tail, much like thejoining of train carriages. Consequently, there is never any intermixingof the access points within the sub networks, only on the boundaryaccess points.

If the two sub-networks had previously dedicated a set of one or morefrequencies to be the “common” frequencies not used internally withineach network, then the two networks may now join with no frequencychanges for connections within each network. The joining of node 721 and711, forming a new link 735 will use the common frequency. Bydefinition, the common frequency does not interfere with the frequenciesused internally within each network. Inasmuch as the two networks do notintermix, the internal frequencies used by each network are arbitrary.Even if the internal frequencies of sub networks 720 and 710 areidentical, no interference will occur since frequencies different fromthose used internally in either sub network will be used for joining,The sole point of communication between the two networks is the new link735 which may adopt the common frequency for communications between thetwo networks without any internal frequency reassignments.

Joining Using Underutilized Frequencies

An additional means for facilitating network combinations is to includethe capability to operate in more than one frequency range. For example,if two nodes have detected one another, the nodes may exchange radiocapability information prior to establishing a permanent link. Uponexchanging capabilities information, the nodes may detect that each nodeincludes the capability to broadcast in frequencies beyond the usualfrequencies used within the network. Consequently, joining on thispreviously unexploited frequency range virtually guarantees a networkjoin without having channel changes propagated within each sub network.

For example, in FIG. 7, in one embodiment, nodes comprising the subnetwork 720 all communicate in various frequencies in and around 2.4GHz. Similarly, sub network 710 uses a similar set of frequencies in andaround 2.4 GHz. The 2.4 GHz frequencies were chosen for the two subnetworks to accommodate the client devices within each sub-network.However, for the communication between the two nodes, node 721 and node711 may adopt a completely different range. In one embodiment, node 711being the tail node, and node 721 being the root node, include anadditional 5 GHz communication capability which can be accomplished withmultiple frequency range radios and wideband antennas, or by includingadditional radios and/or antennas. Consequently, the two nodes 721 and711 are able to establish a link 735 without any chance of interferencewith the respective internal links within each sub-network.

Each node contains connectivity logic which allows the node to adopt oneor more of the above-described contention resolution policies. Further,the connectivity logic is designed to update the list of possiblealternate policies which may be applied by individual nodes separately,or in unison. Each policy is activated depending on the environmentalcircumstances encountered by each mesh network. For example, in theevent that the mesh networks are deployed as part of a structuredconvoy, certain policies are more applicable than others (as describedabove). Upon the joining of two networks together, the connectivitylogic of each constituent node may be updated to reflect the commonnetwork created by the nodes.

To the extent that the figures illustrate diagrams of the functionalblocks of various embodiments, the functional blocks are not necessarilyindicative of the division between hardware circuitry. Thus, forexample, one or more of the functional blocks (e.g. processors ormemories) may be implemented in a single piece of hardware (e.g. ageneral purpose signal processor or a block of random access memory,hard disk or the like). Similarly, the programs may be stand-aloneprograms, may be incorporated as subroutines in an operating system, maybe functions in an installed software package, and the like. It shouldbe understood that the various embodiments are not limited to thearrangements and instrumentality shown in the drawings.

It is to be understood that the above description is intended to beillustrative, and not restrictive. For example, the above-describedembodiments (and/or aspects thereof) may be used in combination witheach other. In addition, many modifications may be made to adapt aparticular situation or material to the teachings of the inventionwithout departing from its scope. While the dimensions and types ofmaterials described herein are intended to define the parameters of theinvention, they are by no means limiting, but are instead are exemplaryembodiments. Many other embodiments will be apparent to those of skillin the art upon reviewing the above description. The scope of theinvention should, therefore, be determined with reference to theappended claims, along with the full scope of equivalents to which suchclaims are entitled. In the appended claims, the terms “including” and “in which” are used as the plain-English equivalents of the terms“comprising” and “wherein.” Moreover, in the following claims, the terms“first,” “second,” and “third,” are used merely as labels, and are notintended to impose numerical requirements on their objects. Further, thelimitations of the following claims are not written inmeans-plus-function format and are not intended to be interpreted basedon 35 U.S.C. §112, sixth paragraph, unless and until such claimlimitations expressly use the phrase “means for” followed by a statementof function void of further structure.

The invention claimed is:
 1. A structured mesh network capable ofisolated operation, comprising: at least two structured mesh nodes;wherein each structured mesh node comprises at least a connectivitylogic; an uplink radio operating on an uplink frequency and a downlinkradio operating on a distinct downlink frequency; wherein theconnectivity logic determines whether each structured mesh node connectswith an external network or another node using its uplink radio andclient devices or other mesh nodes connect to each node using eachnode's downlink radio; wherein the structured mesh network functions intwo configurations selected depending on whether a connection to anexternal network is present; in the first connected configuration thestructured mesh network includes at least one structured mesh node'suplink radio comprising a connection to an external network; and in thesecond isolated configuration none of the structured mesh nodes' uplinkradio comprises a connection to an external network, and one of thestructured mesh nodes acts as an isolated network root of the isolatedconfiguration and all remaining nodes connect to the isolated networkroot node as isolated root children nodes forming a tree configuration;wherein clients of nodes of the structured network in a second isolatedconfiguration retain full connectivity within the structured networkduring the isolated configuration and wherein said client connectivityis uninterrupted during any transition from the isolated configurationto the first connected configuration; wherein distinct downlinkfrequencies are used by nodes for communication with one or more nodeslower on the tree configuration.
 2. The structured mesh network of claim1 wherein the connectivity logic contained by the nodes realignsconnections between the nodes upon loss of an external connection toform the isolated configuration.
 3. The structured mesh network of claim2 wherein the connectivity logic contained by the nodes designates thenode which in the first configuration connected to the external networkas the isolated configuration root node.
 4. The structured mesh networkof claim 2 wherein the connectivity logic contained by the nodesdesignates the node which in the first configuration passed the mosttraffic as the isolated configuration root node.
 5. The structured meshnetwork of claim 2 wherein the connectivity logic contained by the nodesselects the isolated configuration root node such that the resultingnetwork's traffic traverses a minimal number of nodes.
 6. The structuredmesh network of claim 2 wherein the connectivity logic contained by thenodes selects the isolated configuration root node such that theisolated configuration root node is the most proximate to an externalnetwork connection point.
 7. The structured mesh network of claim 2wherein the connectivity logic contained by the nodes selects theisolated configuration root node such that the resulting network'sthroughput is maximized.
 8. The structured mesh network of claim 2wherein the connectivity logic contained by the nodes selects theisolated configuration root node such that the resulting network'slatency is minimized.
 9. The structured mesh network of claim 1 whereinthe connectivity logic contained by the nodes realigns connectionsbetween the nodes upon detection of an external network connection toform the connected configuration.
 10. The structured mesh network ofclaim 9 wherein solely the isolated network root node logic searches forthe external network connection and establishes the external networkconnection.
 11. The structured mesh network of claim 10 wherein thepreviously unused uplink radio of the isolated network root node is usedto connect to the external network.
 12. The structured mesh network ofclaim 1 wherein a first mesh network in the isolated configurationcomprises an isolated root node and one or more isolated children nodesand a second mesh network in the isolated configuration comprises andisolated root node and at least one or more isolated children nodes andat least one child node of the first network establishes communicationwith a child node of the second network, thereby triggering arealignment due to joining in both networks.
 13. The structured meshnetwork of claim 12 wherein as part of the realignment due to joiningone of the isolated root nodes becomes an isolated network child nodewherein the isolated root node of the smaller of the two networksbecomes the child node.
 14. The structured mesh network of claim 12wherein as part of the realignment due to joining one of the isolatedroot nodes becomes an isolated network child node wherein the selectionof the new isolated root node is made on the basis of physical positionand direction of travel of the two networks.
 15. The structured meshnetwork of claim 1 wherein a first mesh network in the isolatedconfiguration comprises an isolated root node and one or more isolatedchildren nodes and a second mesh network in the isolated configurationcomprises an isolated root node and at least one or more isolatedchildren nodes and the root node of the first network establishescommunication with a child node of the second network, thereby the rootnode of the first network becomes a child node of the second network.16. The structured mesh network of claim 15 wherein the unused uplinkradio on the root node of the first network is used to connect to thechild node of the second network.
 17. The structured mesh network ofclaim 16 wherein solely the root node of the first network is able toconnect to a child of the second network.
 18. The structured meshnetwork of claim 1 wherein each network node further comprises a DHCPserver used to assign addresses to client devices communicating with thenode using the node's downlink radio.
 19. The structured mesh network ofclaim 18 wherein the DHCP server within each node assigns IP addressesto client devices containing one or more random numbers within the IPaddresses.
 20. A multi-part mesh network comprising: a first meshnetwork and a second mesh network wherein each mesh network comprises:a) at least two structured mesh nodes; wherein each structured mesh nodecomprises at least a connectivity logic; an uplink radio operating on anuplink frequency and a distinct downlink radio operating on a downlinkfrequency; wherein the connectivity logic determines whether eachstructured mesh node connects with an external network or another nodeusing its uplink radio and client devices or other mesh nodes connect toeach node using each node's downlink radio; wherein the structured meshnetwork functions in two configurations selected depending on whether aconnection to an external network is present; b) in the first connectedconfiguration the structured mesh network includes at least onestructured mesh node's uplink radio comprises a connection to anexternal network; and c) in the second isolated configuration none ofthe structured mesh nodes' uplink radio comprises a connection to anexternal network, and one of the structured mesh nodes acts as anisolated network root of the isolated configuration and all remainingnodes' connect to the isolated network root node as isolated rootchildren nodes forming a tree configuration; wherein a first set offrequencies, the first network frequencies, is used by the first networkfor communications between the nodes of the first network; a second setof frequencies, the common frequencies, is used for communicationsbetween the two networks; and a third set of frequencies, the secondnetwork frequencies, is used for communications between the nodes of thesecond network; wherein each network is in the isolated configuration;and wherein initially no communication between the first network and thesecond network is occurring; wherein clients of nodes of each network inthe multi-part mesh network in the isolated configuration retain fullconnectivity within the network and wherein distinct downlinkfrequencies are used by nodes for communication with one or more nodeslower on the tree configuration.
 21. The multi-part mesh network ofclaim 20 wherein the first set of frequencies and the third set offrequencies are mutually exclusive.
 22. The multi-part mesh network ofclaim 20 wherein upon establishment of new communication between a childnode of the first network and a child node of the second network theisolated root node of either the first network or the second networkbecomes the root node of a resulting multi-part network.
 23. Themulti-part mesh network of claim 22 wherein the connectivity logic ofthe root node of the root of the first network and the connectivitylogic of the root of the second network select of the root node of theresulting multi-part network pursuant to a policy directive.
 24. Themulti-part mesh network of claim 23 wherein the policy directive isbased on the relative sizes of each network.
 25. The multi-part meshnetwork of claim 23 wherein the policy directive comprises a weighing ofthe direction of travel of each network and the position of eachnetwork.
 26. The multi-part mesh network of claim 23 wherein the policydirective comprises minimizing the latency of the resulting multi-partmesh network or maximizing the throughput of the multi-part network. 27.The multi-part mesh network of claim 20 wherein upon establishment ofnew communication between the root node of the first network and a childnode of the second network the isolated root node of the first networkbecomes a child node of the second network.
 28. The multi-part meshnetwork of claim 27 wherein the unused uplink of the first network rootnode is used to communicate with the child node of the second network.29. The multi-part mesh network of claim 28 wherein solely the root nodeof the first network may connect to a node of the second network. 30.The multi-part mesh network of claim 20 wherein each network comprisesone or more leaf nodes wherein leaf nodes are child nodes to which noother node communicates with using the leaf node's downlink radio, andthe leaf nodes only attempt to connect using the common frequencies. 31.The multi-part mesh network of claim 20 wherein the uplink radios of theroot nodes of each network attempt to connect solely using the commonfrequencies.
 32. The structured mesh network of claim 20 wherein eachnetwork node further comprises a DHCP server used to assign addresses toclient devices communicating with the node using the node's downlinkradio.
 33. The structured mesh network of claim 32 wherein the DHCPserver within each node assigns IP addresses to client devicescontaining one or more random numbers within the IP addresses.
 34. Thestructured mesh network of claim 33 wherein said uplink and downlinkfrequencies are the same frequency.
 35. A structured mesh networkcapable of isolated operation, comprising: at least two structured meshnodes; wherein each structured mesh node comprises at least aconnectivity logic and a radio operating on an uplink frequency and adistinct downlink frequency; wherein the connectivity logic determineswhether each structured mesh node connects with an external network oranother node on the uplink frequency and client devices or other meshnodes connect to each node on the downlink frequency; wherein theconnectivity logic in each node contains a distributed routing table;wherein the structured mesh network functions in two configurationsselected depending on whether a connection to an external network ispresent; in the first connected configuration the structured meshnetwork includes at least one structured mesh node's uplink connectioncomprising a connection to an external network; and in the secondisolated configuration none of the structured mesh nodes' uplinkconnections comprises a connection to an external network, and one ofthe structured mesh nodes acts as an isolated network root of theisolated configuration and all remaining nodes connect to the isolatednetwork root node as isolated root children and descendant nodes forminga tree configuration; wherein clients of the at least two structuredmesh nodes in a second isolated configuration retain full connectivitywithin the structured network during the isolated configuration andwherein said client connectivity is uninterrupted during any transitionfrom the isolated configuration to the first connected configuration;wherein distinct downlink frequencies are used by nodes forcommunication with one or more nodes lower on the tree configuration.